Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
نویسندگان
چکیده
منابع مشابه
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applications and cryptographic accelerators. Fast modular exponentiation algorithms are often considered of practical significance in public-key cryptosystems. The RSA cryptosystem is one of the most widely used technologies f...
متن کاملGeneralizations of RSA Public Key Cryptosystem
In this paper, for given N = pq with p and q different odd primes, and m = 1, 2, · · · , we give a public key cryptosystem. When m = 1 the system is just the famous RSA system. And when m ≥ 2, the system is usually more secure than the one with m = 1.
متن کاملPublic Key Cryptography and the RSA Cryptosystem
Cryptography, or cryptology, is a subject that is concerned with privacy or confidentiality of communication over insecure channels, in the presence of adversaries. It seeks to find ways to encrypt messages so that even if an unauthorized party gets a hold of a message, they cannot make sense out of it. The ways to break encryption systems, called cryptanalysis, is also part of the subject. Cry...
متن کاملImplementation of the RSA Public - Key Cryptosystem
The history of secret messages, cryptosystems, codes and codecracking is as old as the history of man. In this article, we will deal with the cryptosystem proposed by Rivest, Shamir and Adleman in 1977, see [3]. It has two characteristics which distinguish it from most other encryption methods: The usage of Number Theory and the fact that the process of deciphering is not just opposite to the o...
متن کاملAn efficient VLSI architecture for RSA public-key cryptosystem
In this paper, a new efficient VLSI archtecture to compute RSA public-key cryptosystem is proposed. The modified H-algorithm is applied to fmd the modular exponentiation. By this modified Halgorithm, the modular multiplication steps reduced about 5dl8. For the modular multiplication the L-algorithm (LSB first) is used. In the architecture of the modular multiplication the iteration times are on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2006
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2006.148